Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
c(a(a(b(a(x1))))) → a(a(b(a(c(c(a(a(b(x1)))))))))
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
c(a(a(b(a(x1))))) → a(a(b(a(c(c(a(a(b(x1)))))))))
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
C(a(a(b(a(x1))))) → C(a(a(b(x1))))
C(a(a(b(a(x1))))) → C(c(a(a(b(x1)))))
The TRS R consists of the following rules:
c(a(a(b(a(x1))))) → a(a(b(a(c(c(a(a(b(x1)))))))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
C(a(a(b(a(x1))))) → C(a(a(b(x1))))
C(a(a(b(a(x1))))) → C(c(a(a(b(x1)))))
The TRS R consists of the following rules:
c(a(a(b(a(x1))))) → a(a(b(a(c(c(a(a(b(x1)))))))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.